package TG_820;

public class TrieNode {
	TrieNode[] children;
	int count;

	TrieNode() {
		children = new TrieNode[26];
		count = 0;
	}

	public TrieNode get(char c) {
		if (children[c - 'a'] == null) {
			children[c - 'a'] = new TrieNode();
			count++;
		}
		return children[c - 'a'];
	}
}
